A New Characterization of P4-connected Graphs
نویسندگان
چکیده
A graph is said to be P 4-connected if for every partition of its vertex-set into two nonempty disjoint sets, some P 4 in the graph has vertices from both sets in the partition. A P 4-chain is a sequence of vertices such that every four consecutive ones induce a P 4. The main result of this work states that a graph is P 4-connected if and only if each pair of vertices is connected by a P 4-chain. Our proof relies, in part, on a linear-time algorithm that, given two disitnct vertices, exhibits a P 4-chain connecting them. In addition to shedding new light on the structure of P 4-connected graphs, our result extends a previously known theorem about the P 4-structure of unbreakable graphs.
منابع مشابه
Split-Perfect Graphs: Characterizations and Algorithmic Use
Two graphs G and H with the same vertex set V are P4-isomorphic if every four vertices {a, b, c, d} ⊆ V induce a chordless path (denoted by P4) in G if and only if they induce a P4 in H. We call a graph split-perfect if it is P4-isomorphic to a split graph (i.e., a graph being partitionable into a clique and a stable set). This paper characterizes the new class of split-perfect graphs using the...
متن کاملOn vertex neighborhood in minimal imperfect graphs
Lubiw [11] conjectures that in a minimal imperfect Berge graph, the neighborhood graph N (v) of any vertex v must be connected; this conjecture implies a well known Chvátal’s Conjecture [6] which states that N (v) must contain a P4. In this note we will prove an intermediary conjecture for some classes of minimal imperfect graphs. It is well known that a graph is P4-free if, and only if, every ...
متن کاملLinkage for the diamond and the path with four vertices
Given graphs G and H , we say G is H-linked if for every injective mapping ` : V (H) → V (G) we can find a subgraphH ′ of G that is a subdivision of H , with `(v) being the vertex of H ′ corresponding to each vertex v of H . In this paper we prove two results on H-linkage for 4-vertex graphs H . Goddard showed that 4-connected planar triangulations are 4-ordered, or in other words C4-linked. We...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملLinear Time Recognition of P4-Indifferent Graphs
A simple graph is P4-indifferent if it admits a total order < on its nodes such that every chordless path with nodes a, b, c, d and edges ab, bc, cd has a < b < c < d or a > b > c > d. P4-indifferent graphs generalize indifferent graphs and are perfectly orderable. Recently, Hoàng, Maffray and Noy gave a characterization of P4-indifferent graphs in terms of forbidden induced subgraphs. We clari...
متن کامل